An Approach for Delaunay Tetrahedralization of Bodies with Curved Boundaries

نویسندگان

  • Sergey Borovikov
  • Igor A. Kryukov
  • Igor E. Ivanov
چکیده

Problem of tetrahedral meshing of three-dimensional domains whose boundaries are curved surfaces is wide open. Traditional approach consists in an approximation of curved boundaries by piecewise linear boundaries before mesh generation. As the result mesh quality may deteriorate. This paper presents a technique for Delaunay-based tetrahedralization in which a set of constrained facets is formed dynamically during face recovery and mechanisms for mutual retriangulation of the curved faces and the tetrahedralization are suggested. The proposed algorithm is constructed in such a way that a facet that was once added in the set of constrained facets is never split into small triangles. It allows retaining the high quality of surface mesh in the tetrahedralization, because during boundary recovery the surface mesh on the curved faces and the tetrahedralization are refined conjointly.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Strange Complexity of Constrained Delaunay Triangulation

The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomial-time solution. Constrained Delaunay tetrahedralization has the unusual status (for a small-dimensional problem) of being NP-hard only for degenerate inputs.

متن کامل

Flipping to Robustly Delete a Vertex in a Delaunay Tetrahedralization

We discuss the deletion of a single vertex in a Delaunay tetrahedralization (DT). While some theoretical solutions exist for this problem, the many degeneracies in three dimensions make them impossible to be implemented without the use of extra mechanisms. In this paper, we present an algorithm that uses a sequence of bistellar flips to delete a vertex in a DT, and we present two different mech...

متن کامل

Three-Dimensional Delaunay Mesh Generation Using a Modified Advancing Front Approach

We introduce a meshing method which uses an advancing front Delaunay algorithm. The presented Delaunay technique avoids the need for a temporary tetrahedralization of the convex hull and a later following segmentation step which is typical for commonly used methods. The algorithm is suitable for local regridding applications. This is an important issue for element quality improvements and for m...

متن کامل

Guaranteed-quality triangular mesh generation for domains with curved boundaries

Guaranteed-quality unstructured meshing algorithms facilitate the development of automatic meshing tools. However, these algorithms require domains discretized using a set of linear segments, leading to numerical errors in domains with curved boundaries. We introduce an extension of Ruppert’s Delaunay refinement algorithm to domains with curved boundaries and prove that the same quality bounds ...

متن کامل

Fast Parallel Triangulation Algorithm of Large Data Sets in E

A triangulation of points in , or a tetrahedronization of points in , is used in many applications. It is not necessary to fulfill the Delaunay criteria in all cases. For large data (more then points), parallel methods are used for the purpose of decreasing time complexity. A new approach for fast and effective parallel CPU and GPU triangulation, or tetrahedronization, of large data sets in or ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005